home *** CD-ROM | disk | FTP | other *** search
/ Cream of the Crop 26 / Cream of the Crop 26.iso / program / ddj0897.zip / DYN401.ZIP / class / btree.c < prev    next >
C/C++ Source or Header  |  1997-04-16  |  8KB  |  297 lines
  1.  
  2.  
  3. /*  Copyright (c) 1993-1996 Algorithms Corporation  */
  4. /*  All rights reserved.  */
  5.  
  6.  
  7.  
  8.  
  9. /*  This file automatically generated by dpp - do not edit  */
  10.  
  11. #define    DPP_STRATEGY    2
  12. #define    DPP_FASTWIDE    0
  13.  
  14.  
  15.  
  16.  
  17. #define    CLASS    BTree_c
  18. #define    ivType    BTree_iv_t
  19.  
  20. #include "generics.h"
  21.  
  22. object    BTree_c;
  23.  
  24.  
  25. #line 26 "btree.c"
  26. typedef struct  _BTree_iv_t  {
  27.     object iNodes;
  28.     long iNum;
  29.     ifun iCmpFun;
  30.     CRITICALSECTION iCS;
  31. }    BTree_iv_t;
  32.  
  33.  
  34.  
  35. #line 26 "btree.d"
  36. imeth ofun BTree_im_gSetFunction(object self, int (*fun)())
  37. { BTree_iv_t *iv = GetIVs(BTree, self);
  38.     ofun old = (ofun) iv->iCmpFun; 
  39.     iv->iCmpFun = fun; 
  40.     return old; 
  41. } 
  42.  
  43. cmeth objrtn BTree_cm_gNew(object self)
  44. { 
  45.     object obj = oSuper(BTree_c, gNew, self)(self); 
  46.     accessIVsOf(obj); 
  47.     INITIALIZECRITICALSECTION(iv->iCS); 
  48.     return obj; 
  49. } 
  50.  
  51. imeth objrtn BTree_im_gDeepDispose(object self)
  52. { BTree_iv_t *iv = GetIVs(BTree, self);
  53.     ENTERCRITICALSECTION(iv->iCS); 
  54.     if (iv->iNodes) 
  55.         gDeepDispose(iv->iNodes); 
  56.     LEAVECRITICALSECTION(iv->iCS); 
  57.     DELETECRITICALSECTION(iv->iCS); 
  58.     return oSuper(BTree_c, gDispose, self)(self); 
  59. } 
  60.  
  61. imeth objrtn BTree_im_gDispose(object self)
  62. { BTree_iv_t *iv = GetIVs(BTree, self);
  63.     ENTERCRITICALSECTION(iv->iCS); 
  64.     if (iv->iNodes) 
  65.         gDispose(iv->iNodes); 
  66.     LEAVECRITICALSECTION(iv->iCS); 
  67.     DELETECRITICALSECTION(iv->iCS); 
  68.     return oSuper(BTree_c, gDispose, self)(self); 
  69. } 
  70.  
  71. imeth objrtn BTree_im_gDeepDisposeAllNodes(object self)
  72. { BTree_iv_t *iv = GetIVs(BTree, self);
  73.     ENTERCRITICALSECTION(iv->iCS); 
  74.     if (iv->iNodes) 
  75.         iv->iNodes = gDeepDispose(iv->iNodes); 
  76.     iv->iNum = 0; 
  77.     LEAVECRITICALSECTION(iv->iCS); 
  78.     return self; 
  79. } 
  80.  
  81. imeth objrtn BTree_im_gDisposeAllNodes(object self)
  82. { BTree_iv_t *iv = GetIVs(BTree, self);
  83.     ENTERCRITICALSECTION(iv->iCS); 
  84.     if (iv->iNodes) 
  85.         iv->iNodes = gDispose(iv->iNodes); 
  86.     iv->iNum = 0; 
  87.     LEAVECRITICALSECTION(iv->iCS); 
  88.     return self; 
  89. } 
  90.  
  91. imeth int BTree_im_gSize(object self)
  92. { BTree_iv_t *iv = GetIVs(BTree, self);
  93.     return iv->iNum; 
  94. } 
  95.  
  96. imeth objrtn BTree_im_gSetTopNode(object self, object new)
  97. { BTree_iv_t *iv = GetIVs(BTree, self);
  98.     iv->iNodes = new; 
  99.     return self; 
  100. } 
  101.  
  102. imeth objrtn BTree_im_gAddValue(object self, object key, object val)
  103. { BTree_iv_t *iv = GetIVs(BTree, self);
  104.     object old=NULL; 
  105.     int replaced; 
  106.  
  107.     ENTERCRITICALSECTION(iv->iCS); 
  108.     if (!iv->iNodes) { 
  109.         if (!iv->iCmpFun) 
  110.             iv->iCmpFun = gCompare; 
  111.         iv->iNodes = gNewNode(BTreeNode, self, 2); 
  112.     } 
  113.     gAddBTreeNode(iv->iNodes, iv->iCmpFun, key, val, 1, &replaced, NULL, &old); 
  114.     if (replaced == 1) 
  115.         iv->iNum++; 
  116.     LEAVECRITICALSECTION(iv->iCS); 
  117.     return old; 
  118. } 
  119.  
  120. imeth objrtn BTree_im_gFindEQ(object self, object key, object *foundKey)
  121. { BTree_iv_t *iv = GetIVs(BTree, self);
  122.     object r; 
  123.     ENTERCRITICALSECTION(iv->iCS); 
  124.     r = iv->iNodes && iv->iNum ? gFindBTNEQ(iv->iNodes, iv->iCmpFun, key, foundKey) : NULLOBJ; 
  125.     LEAVECRITICALSECTION(iv->iCS); 
  126.     return r; 
  127. } 
  128.  
  129. imeth objrtn BTree_im_gFindGE(object self, object key, object *foundKey)
  130. { BTree_iv_t *iv = GetIVs(BTree, self);
  131.     object r; 
  132.     ENTERCRITICALSECTION(iv->iCS); 
  133.     r = iv->iNodes && iv->iNum ? gFindBTNGE(iv->iNodes, iv->iCmpFun, key, foundKey) : NULLOBJ; 
  134.     LEAVECRITICALSECTION(iv->iCS); 
  135.     return r; 
  136. } 
  137.  
  138. imeth objrtn BTree_im_gFindGT(object self, object key, object *foundKey)
  139. { BTree_iv_t *iv = GetIVs(BTree, self);
  140.     object r; 
  141.     ENTERCRITICALSECTION(iv->iCS); 
  142.     r = iv->iNodes && iv->iNum ? gFindBTNGT(iv->iNodes, iv->iCmpFun, key, foundKey) : NULLOBJ; 
  143.     LEAVECRITICALSECTION(iv->iCS); 
  144.     return r; 
  145. } 
  146.  
  147. imeth objrtn BTree_im_gFindNext(object self, object *foundKey)
  148. { BTree_iv_t *iv = GetIVs(BTree, self);
  149.     object r; 
  150.     ENTERCRITICALSECTION(iv->iCS); 
  151.     if (*foundKey) { 
  152.         object key = *foundKey; 
  153.         r = gFindBTNGT(iv->iNodes, iv->iCmpFun, key, foundKey); 
  154.     } else 
  155.         r = gFindFirst(self, foundKey); 
  156.     LEAVECRITICALSECTION(iv->iCS); 
  157.     return r; 
  158. } 
  159.  
  160. imeth objrtn BTree_im_gFindLE(object self, object key, object *foundKey)
  161. { BTree_iv_t *iv = GetIVs(BTree, self);
  162.     object r; 
  163.     ENTERCRITICALSECTION(iv->iCS); 
  164.     r = iv->iNodes && iv->iNum ? gFindBTNLE(iv->iNodes, iv->iCmpFun, key, foundKey) : NULLOBJ; 
  165.     LEAVECRITICALSECTION(iv->iCS); 
  166.     return r; 
  167. } 
  168.  
  169. imeth objrtn BTree_im_gFindLT(object self, object key, object *foundKey)
  170. { BTree_iv_t *iv = GetIVs(BTree, self);
  171.     object r; 
  172.     ENTERCRITICALSECTION(iv->iCS); 
  173.     r = iv->iNodes && iv->iNum ? gFindBTNLT(iv->iNodes, iv->iCmpFun, key, foundKey) : NULLOBJ; 
  174.     LEAVECRITICALSECTION(iv->iCS); 
  175.     return r; 
  176. } 
  177.  
  178. imeth objrtn BTree_im_gFindPrev(object self, object *foundKey)
  179. { BTree_iv_t *iv = GetIVs(BTree, self);
  180.     object r; 
  181.     ENTERCRITICALSECTION(iv->iCS); 
  182.     if (*foundKey) { 
  183.         object key = *foundKey; 
  184.         r = gFindBTNLT(iv->iNodes, iv->iCmpFun, key, foundKey); 
  185.     } else 
  186.         r = gFindLast(self, foundKey); 
  187.     LEAVECRITICALSECTION(iv->iCS); 
  188.     return r; 
  189. } 
  190.  
  191. imeth objrtn BTree_im_gFindFirst(object self, object *foundKey)
  192. { BTree_iv_t *iv = GetIVs(BTree, self);
  193.     object r; 
  194.     ENTERCRITICALSECTION(iv->iCS); 
  195.     r = iv->iNodes && iv->iNum ? gFindBTNFirst(iv->iNodes, iv->iCmpFun, foundKey) : NULLOBJ; 
  196.     LEAVECRITICALSECTION(iv->iCS); 
  197.     return r; 
  198. } 
  199.  
  200. imeth objrtn BTree_im_gFindLast(object self, object *foundKey)
  201. { BTree_iv_t *iv = GetIVs(BTree, self);
  202.     object r; 
  203.     ENTERCRITICALSECTION(iv->iCS); 
  204.     r = iv->iNodes && iv->iNum ? gFindBTNLast(iv->iNodes, iv->iCmpFun, foundKey) : NULLOBJ; 
  205.     LEAVECRITICALSECTION(iv->iCS); 
  206.     return r; 
  207. } 
  208.  
  209. imeth objrtn BTree_im_gDisposeObj(object self, object key)
  210. { BTree_iv_t *iv = GetIVs(BTree, self);
  211.     object res; 
  212.     ENTERCRITICALSECTION(iv->iCS); 
  213.     res = iv->iNodes && iv->iNum ? gDeleteBTNode(iv->iNodes, iv->iCmpFun, key, 0, NULL) : NULL; 
  214.     if (res) 
  215.         iv->iNum--; 
  216.     LEAVECRITICALSECTION(iv->iCS); 
  217.     return res; 
  218. } 
  219.  
  220. imeth objrtn BTree_im_gDeepDisposeObj(object self, object key)
  221. { BTree_iv_t *iv = GetIVs(BTree, self);
  222.     object res; 
  223.     ENTERCRITICALSECTION(iv->iCS); 
  224.     res = iv->iNodes && iv->iNum ? gDeleteBTNode(iv->iNodes, iv->iCmpFun, key, 1, NULL) : NULL; 
  225.     if (res) 
  226.         iv->iNum--; 
  227.     LEAVECRITICALSECTION(iv->iCS); 
  228.     return res; 
  229. } 
  230.  
  231. imeth objrtn BTree_im_gPrint(object self, object stream)
  232. { BTree_iv_t *iv = GetIVs(BTree, self);
  233.     ENTERCRITICALSECTION(iv->iCS); 
  234.     vPrintf(stream, "BTree [%8.8lx], %ld keys, first node is %8.8lx\n", self, iv->iNum, iv->iNodes); 
  235.     if (iv->iNodes) { 
  236.         gPuts(stream, "\n------------------------------------------------------------\n"); 
  237.         gPrint(iv->iNodes, stream); 
  238.     } 
  239.     LEAVECRITICALSECTION(iv->iCS); 
  240.     return self; 
  241. } 
  242.  
  243.  
  244. #line 245 "btree.c"
  245.  
  246. objrtn    BTree_initialize(void)
  247. {
  248.     static  CRITICALSECTION  cs;
  249.     static  int volatile once = 0;
  250.  
  251.     ENTERCRITICALSECTION(_CI_CS_);
  252.     if (!once) {
  253.         INITIALIZECRITICALSECTION(cs);
  254.         once = 1;
  255.     }
  256.     LEAVECRITICALSECTION(_CI_CS_);
  257.  
  258.     ENTERCRITICALSECTION(cs);
  259.  
  260.     if (BTree_c) {
  261.         LEAVECRITICALSECTION(cs);
  262.         return BTree_c;
  263.     }
  264.     INHIBIT_THREADER;
  265.     BTree_c = gNewClass(Class, "BTree", sizeof(BTree_iv_t), 0, END);
  266.     cMethodFor(BTree, gNew, BTree_cm_gNew);
  267.     iMethodFor(BTree, gDeepDisposeObj, BTree_im_gDeepDisposeObj);
  268.     iMethodFor(BTree, gSetFunction, BTree_im_gSetFunction);
  269.     iMethodFor(BTree, gFindGE, BTree_im_gFindGE);
  270.     iMethodFor(BTree, gFindLT, BTree_im_gFindLT);
  271.     iMethodFor(BTree, gFindPrev, BTree_im_gFindPrev);
  272.     iMethodFor(BTree, gDisposeObj, BTree_im_gDisposeObj);
  273.     iMethodFor(BTree, gPrint, BTree_im_gPrint);
  274.     iMethodFor(BTree, gDisposeAllNodes, BTree_im_gDisposeAllNodes);
  275.     iMethodFor(BTree, gFindLast, BTree_im_gFindLast);
  276.     iMethodFor(BTree, gSize, BTree_im_gSize);
  277.     iMethodFor(BTree, gDeepDisposeAllNodes, BTree_im_gDeepDisposeAllNodes);
  278.     iMethodFor(BTree, gFindGT, BTree_im_gFindGT);
  279.     iMethodFor(BTree, gDispose, BTree_im_gDispose);
  280.     iMethodFor(BTree, gFindFirst, BTree_im_gFindFirst);
  281.     iMethodFor(BTree, gFindLE, BTree_im_gFindLE);
  282.     iMethodFor(BTree, gFindEQ, BTree_im_gFindEQ);
  283.     iMethodFor(BTree, gSetTopNode, BTree_im_gSetTopNode);
  284.     iMethodFor(BTree, gAddValue, BTree_im_gAddValue);
  285.     iMethodFor(BTree, gDeepDispose, BTree_im_gDeepDispose);
  286.     iMethodFor(BTree, gFindNext, BTree_im_gFindNext);
  287.  
  288.     ENABLE_THREADER;
  289.  
  290.     LEAVECRITICALSECTION(cs);
  291.  
  292.     return BTree_c;
  293. }
  294.  
  295.  
  296.  
  297.